Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity
نویسندگان
چکیده
منابع مشابه
Linear Context-Free Rewriting Systems and Deterministic Tree-Walking Transducers
I n t r o d u c t i o n In [9] a comparison was made of the generative capacity of a number of grammar formalisms. Several were found to share a number of characteristics (described below) and the class of such formalisms was called linear context-free rewriting systems. This paper shows how the class of string languages generated by linear context-free rewriting systems relates to a number of ...
متن کاملThe complexity of typechecking tree-walking tree transducers?
Tree-walking tree transducers can be typechecked in double exponential time. More generally, compositions of k tree-walking tree transducers can be typechecked in (k + 1)-fold exponential time.
متن کاملMacro Tree Translations of Linear Size Increase are MSO Definable
The first main result is that if a macro tree translation is of linear size increase, i.e., if the size of every output tree is linearly bounded by the size of the corresponding input tree, then the translation is MSO definable (i.e., definable in monadic second-order logic). This gives a new characterization of the MSO definable tree translations in terms of macro tree transducers: they are ex...
متن کاملA note on the complexity of deterministic tree-walking transducers
The deterministic tree-walking transducer is one of a number of possible formalisms for defining mildly context-sensitive languages. It is well known that the non-uniform membership problem for languages that can be defined in this formalism is solvable in polynomial time. The uniform membership problem, where both the transducer and the word in question are considered part of the input, is les...
متن کاملType Checking of Tree Walking Transducers
Tree walking transducers are an expressive formalism for reasoning about XSLT-like document transformations. One of the useful properties of tree transducers is decidability of type checking: given a transducer and input and output types, it can be checked statically whether the transducer is type correct, i.e., whether each document adhering to the input type is necessarily transformed into do...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Informatica
سال: 2019
ISSN: 0001-5903,1432-0525
DOI: 10.1007/s00236-019-00360-8